近年来，已经开发了时间序列异常检测算法的特定评估指标来处理经典精度和召回的局限性。但是，这样的指标是作为多个理想方面的总体构建的，引入参数并消除输出的解释性。在本文中，我们首先强调了经典精度/召回的局限性，以及最近基于事件的指标的主要问题 - 例如，我们表明，对手算法可以达到高精度和几乎所有数据集中的回忆在虚弱的假设下。为了应对上述问题，我们根据基于地面真相和预测集之间的``隶属关系''的概念提出了理论上扎根，健壮，无参数和可解释的扩展到精确/回忆指标。我们的指标利用了地面真理和预测之间持续时间的衡量标准，因此具有直观的解释。通过与随机抽样的进一步比较，我们获得了归一化的精度/召回，从而量化了给定的结果一组比随机基线预测更好。通过构造，我们的方法使有关地面真理事件的本地评估保持了本地，从而实现了细粒度的可视化和算法结果的解释。我们将建议与各种公共时间序列检测数据集，算法和指标进行比较。我们进一步得出了隶属指标的理论特性，这些属性给出了对其行为的明确期望，并确保针对对手策略的稳健性。

基于得分的扩散模型是一类生成模型，其动力学由将噪声映射到数据中的随机微分方程描述。尽管最近的作品已经开始为这些模型奠定理论基础，但仍缺乏对扩散时间t的作用的分析理解。当前的最佳实践提倡大型T，以确保正向动力学使扩散足够接近已知和简单的噪声分布。但是，对于更好的分数匹配目标和更高的计算效率，应优选较小的t值。从扩散模型的各种解释开始，在这项工作中，我们量化了这一权衡，并提出了一种新方法，通过采用较小的扩散时间来提高培训和采样的质量和效率。实际上，我们展示了如何使用辅助模型来弥合理想和模拟正向动力学之间的间隙，然后进行标准的反向扩散过程。经验结果支持我们的分析；对于图像数据，我们的方法是竞争性W.R.T.根据标准样本质量指标和对数可能的样本。

流量分类，即识别网络中流动的应用程序类型，是许多活动（例如，入侵检测，路由）的战略任务。这项任务面临当前深度学习方法无法解决的一些关键挑战。当前方法的设计没有考虑到网络硬件（例如路由器）通常以有限的计算资源运行的事实。此外，他们不满足监管机构强调的忠实解释性的需求。最后，这些流量分类器将在小型数据集上进行评估，这些数据集未能反映现实世界中应用程序的多样性。因此，本文引入了用于互联网交通分类的轻巧，高效且可解释的逐卷卷积神经网络（LEXNET），该网络依赖于新的残留块（用于轻巧和效率目的）和原型层（用于解释性）。基于商业级数据集，我们的评估表明，Lexnet成功地保持了与最佳性能最先进的神经网络相同的准确性，同时提供了前面提到的其他功能。此外，我们说明了方法的解释性特征，这源于检测到的应用程序原型与最终用户的交流，我们通过与事后方法的比较来强调Lexnet解释的忠诚。

近年来，近年来，加强学习与图形神经网络（GNN）架构相结合，可以学会解决硬组合优化问题：给定原始输入数据和评估者指导过程，这个想法是自动学习策略返回可行和高质量的输出。最近的工作表明了有希望的结果，但后者主要在旅行推销员问题（TSP）和类似的抽象变体上进行评估，例如分割输送车辆路由问题（SDVRP）。在本文中，我们分析了如何以及最近的神经架构如何应用于实际重要性的图表问题。因此，我们将这些架构系统上“将这些架构转移到电力和信道分配问题（PCAP），其具有实际相关性，例如无线网络中的无线电资源分配。我们的实验结果表明现有的架构（I）仍然无法捕获图形结构特征，并且（II）不适合图表上的动作更改图形属性的问题。在一个积极的票据上，我们表明，增强了距离编码问题的结构表示是迈向学习多用途自主求解器的仍然雄心勃勃的目标的有希望的一步。

虽然深入学习（DL）技术是解决映射到分类任务的网络问题的有前途的工具，但它们的计算复杂性仍然太高，而是相对于实时业务测量要求。为了降低DL推理成本，我们提出了一种新的缓存范例，我们命名为近似密钥缓存，这返回基于缓存的DL推断结果的所选输入的查找的近似结果。虽然近似缓存点击缓解DL推理工作负载并提高系统吞吐量，但是它们介绍了近似误差。因此，我们将近似密钥高速缓存以纠错原理算法，我们命名为Auto-Refresh。我们分析模拟了我们对经典LRU和理想高速缓存的缓存系统性能，我们对预期的绩效进行了跟踪驱动的评估，并比较了我们所提出的方法与最先进的相似性缓存的好处 - 作证我们提案的实际利益。

According to the latest trend of artificial intelligence, AI-systems needs to clarify regarding general,specific decisions,services provided by it. Only consumer is satisfied, with explanation , for example, why any classification result is the outcome of any given time. This actually motivates us using explainable or human understandable AI for a behavioral mining scenario, where users engagement on digital platform is determined from context, such as emotion, activity, weather, etc. However, the output of AI-system is not always systematically correct, and often systematically correct, but apparently not-perfect and thereby creating confusions, such as, why the decision is given? What is the reason underneath? In this context, we first formulate the behavioral mining problem in deep convolutional neural network architecture. Eventually, we apply a recursive neural network due to the presence of time-series data from users physiological and environmental sensor-readings. Once the model is developed, explanations are presented with the advent of XAI models in front of users. This critical step involves extensive trial with users preference on explanations over conventional AI, judgement of credibility of explanation.

Enterprise resource planning (ERP) software brings resources, data together to keep software-flow within business processes in a company. However, cloud computing's cheap, easy and quick management promise pushes business-owners for a transition from monolithic to a data-center/cloud based ERP. Since cloud-ERP development involves a cyclic process, namely planning, implementing, testing and upgrading, its adoption is realized as a deep recurrent neural network problem. Eventually, a classification algorithm based on long short term memory (LSTM) and TOPSIS is proposed to identify and rank, respectively, adoption features. Our theoretical model is validated over a reference model by articulating key players, services, architecture, functionalities. Qualitative survey is conducted among users by considering technology, innovation and resistance issues, to formulate hypotheses on key adoption factors.

Mixtures of von Mises-Fisher distributions can be used to cluster data on the unit hypersphere. This is particularly adapted for high-dimensional directional data such as texts. We propose in this article to estimate a von Mises mixture using a l 1 penalized likelihood. This leads to sparse prototypes that improve clustering interpretability. We introduce an expectation-maximisation (EM) algorithm for this estimation and explore the trade-off between the sparsity term and the likelihood one with a path following algorithm. The model's behaviour is studied on simulated data and, we show the advantages of the approach on real data benchmark. We also introduce a new data set on financial reports and exhibit the benefits of our method for exploratory analysis.

In this work, we introduce a hypergraph representation learning framework called Hypergraph Neural Networks (HNN) that jointly learns hyperedge embeddings along with a set of hyperedge-dependent embeddings for each node in the hypergraph. HNN derives multiple embeddings per node in the hypergraph where each embedding for a node is dependent on a specific hyperedge of that node. Notably, HNN is accurate, data-efficient, flexible with many interchangeable components, and useful for a wide range of hypergraph learning tasks. We evaluate the effectiveness of the HNN framework for hyperedge prediction and hypergraph node classification. We find that HNN achieves an overall mean gain of 7.72% and 11.37% across all baseline models and graphs for hyperedge prediction and hypergraph node classification, respectively.

Graph Neural Networks (GNNs) have become increasingly important in recent years due to their state-of-the-art performance on many important downstream applications. Existing GNNs have mostly focused on learning a single node representation, despite that a node often exhibits polysemous behavior in different contexts. In this work, we develop a persona-based graph neural network framework called PersonaSAGE that learns multiple persona-based embeddings for each node in the graph. Such disentangled representations are more interpretable and useful than a single embedding. Furthermore, PersonaSAGE learns the appropriate set of persona embeddings for each node in the graph, and every node can have a different number of assigned persona embeddings. The framework is flexible enough and the general design helps in the wide applicability of the learned embeddings to suit the domain. We utilize publicly available benchmark datasets to evaluate our approach and against a variety of baselines. The experiments demonstrate the effectiveness of PersonaSAGE for a variety of important tasks including link prediction where we achieve an average gain of 15% while remaining competitive for node classification. Finally, we also demonstrate the utility of PersonaSAGE with a case study for personalized recommendation of different entity types in a data management platform.